Mean field matching and TSP in pseudo - dimension 1
نویسندگان
چکیده
Recent work on optimization problems in random link models has verified several conjectures originating in statistical physics and the replica and cavity methods. In particular the numerical value 2.0415 for the limit length of a traveling salesman tour in a complete graph with uniform [0, 1] edge lengths has been established. In this paper we show that the crucial integral equation obtained with the cavity method has a unique solution, and that the limit ground state energy obtained from this solution agrees with the rigorously derived value. Moreover, the method by which we establish uniqueness of the solution turns out to yield a new completely rigorous derivation of the limit.
منابع مشابه
The mean field traveling salesman and related problems by Johan
In a complete graph on n vertices, the edges are assigned independent random costs from a fixed distribution μ on the non-negative real numbers. This is the mean field model of distance. Several well-known optimization problems consist in finding a set of edges of minimum total cost under certain constraints. Examples are minimum matching, spanning tree, and the traveling salesman problem (TSP)...
متن کاملReplica Symmetry and Combinatorial Optimization
We establish the soundness of the replica symmetric ansatz (introduced by M. Mézard and G. Parisi) for minimum matching and the traveling salesman problem in the pseudo-dimension d mean field model for d ≥ 1. The case d = 1 of minimum matching corresponds to the π2/6-limit for the assignment problem established by D. Aldous in 2001, and the analogous limit for the d = 1 case of TSP was recently...
متن کاملReplica symmetry of the minimum matching
We establish the soundness of the replica symmetric ansatz introduced by M. Mézard and G. Parisi for the minimum matching problem in the pseudo-dimension d mean field model for d ≥ 1. The case d = 1 corresponds to the π2/6-limit for the assignment problem proved by D. Aldous in 2001. We introduce a game-theoretical framework by which we establish the analogous limit also for d > 1.
متن کاملEffective Tour Searching for TSP by Contraction of Pseudo Backbone Edges
Abstract. We introduce a reduction technique for the well-known TSP. The basic idea of the approach consists of transforming a TSP instance to another one with smaller dimension by contracting pseudo backbone edges computed in a preprocessing step, where pseudo backbone edges are edges which are likely to be in an optimal tour. A tour of the small instance can be retransformed to a tour of the ...
متن کاملAn Asymptotic Determination of the Minimum Spanning Tree and Minimum Matching Constants in Geometrical Probability
Given n uniformly and independently distributed points in a ball of unit volume in dimension d, it is well established that the length of several combinatorial optimization problems (including the minimum spanning tree (MST), the minimum matching (M), the traveling salesman problem (TSP), etc.) on these n points is asymptotic to P(d) n(d-1)/d, where the constant B(d) depends on the dimension d ...
متن کامل